Strongly Connected Components can Predict Protein Structure

نویسندگان

  • Eva Bolten
  • Alexander Schliep
  • Sebastian Schneckener
  • Dietmar Schomburg
  • Rainer Schrader
چکیده

Finding the three-dimensional structure of proteins is one of the fundamental problems in molecular biology today. The improvements in throughput of classical methods for determining the structure | e.g., using x-ray di raction analysis or NMR | could not keep up with the ever-increasing speed with which proteins are sequenced. This resulted in a desire for methods for structure prediction solely from sequence data, either ab initio, modeling the molecular folding process, or homology based, using protein sequences with known structures as a template. The main idea is based on the fact that sequence similarity allows to detect homology, i.e., the existence of a common evolutionary predecessor, and thus to infer similar structure and even function virtue of this shared history [10,15]. Note, that the same structure or function does not imply a common ancestor, likewise a common ancestor does not imply a common function, but probably a shared fold.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Twinless Strongly Connected Components

Tarjan [9], describes how depth first search can be used to identify Strongly Connected Components (SCC) of a directed graph in linear time. It is standard to study Tarjan’s SCC algorithm in most senior undergraduate or introductory graduate computer science algorithms courses. In this paper we introduce the concept of a twinless strongly connected component (TSCC) of a directed graph. Loosely ...

متن کامل

Accelerated decomposition techniques for large discounted Markov decision processes

Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...

متن کامل

Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time

We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph, which are straightforward generalizations of strongly connected components. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time, in directed graphs only rather simple O(mn)-time algorithms were known. We use a hierarchical sparsifi...

متن کامل

On spectral radius of strongly connected digraphs

 It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.  

متن کامل

Incremental Strong Connectivity and 2-Connectivity in Directed Graphs

In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs (digraphs), and the strongly connected components that result by the removal of each of those cuts. We give a conditional lower bound that provides evidence that our algorithms may be tight up to a sub-polynomial factors. As an additional resul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2001